Shift-insertion Sort Revisited: Another Statistical Case Study on Parameterized Complexity Using Factorial Experiments
نویسندگان
چکیده
The present paper makes use of factorial experiments to assess software complexity for negative binomial distribution inputs using a new sorting algorithm which we call shift-insertion sort (insertion sort with shifting). Copyright c © 2011 Yang’s Scientific Research Institute, LLC. All rights reserved.
منابع مشابه
Software complexity: A statistical case study through insertion sort
The present paper makes use of factorial experiments to assess software complexity using insertion sort as a trivial example. We next propose to implement the methodology in quicksort and other advanced algorithms.
متن کاملParameterized Complexity: A Statistical Approach Combining Factorial Experiments with Principal Component Analysis
The new sort developed by Sundararajan and Chakarborty (2007), a modification of Quick sort that removes the interchanges, considers the first element of the array as pivot element. In this paper the pivot element taken is a randomly selected element of the array. The effect of binomial parameters are examined on the average sorting complexity using Principal Component Analysis approach. An att...
متن کاملPartition Sort Revisited: Reconfirming the Robustness in Average Case and much more!
In our previous work there was some indication that Partition Sort could be having a more robust average case O(nlogn) complexity than the popular Quick sort. In our first study in this paper, we reconfirm this through computer experiments for inputs from Cauchy distribution for which expectation theoretically does not exist. Additionally, the algorithm is found to be sensitive to parameters of...
متن کاملA Statistical Comparative Study of Some Sorting Algorithms
This research paper is a statistical comparative study of a few average case asymptotically optimal sorting algorithms namely, Quick sort, Heap sort and Ksort. The three sorting algorithms all with the same average case complexity have been compared by obtaining the corresponding statistical bounds while subjecting these procedures over the randomly generated data from some standard discrete an...
متن کاملThe Parameterized Complexity Analysis of Partition Sort for Negative Binomial Distribution Inputs
The present paper makes a study on Partition sort algorithm for negative binomial inputs. Comparing the results with those for binomial inputs in our previous work, we find that this algorithm is sensitive to parameters of both distributions. But the main effects as well as the interaction effects involving these parameters and the input size are more significant for negative binomial case.
متن کامل